(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
from(X) → cons(X, n__from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, activate(XS))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
Rewrite Strategy: FULL
(1) RenamingProof (EQUIVALENT transformation)
Renamed function symbols to avoid clashes with predefined symbol.
(2) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
from(X) → cons(X, n__from(s(X)))
after(0', XS) → XS
after(s(N), cons(X, XS)) → after(N, activate(XS))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
S is empty.
Rewrite Strategy: FULL
(3) SlicingProof (LOWER BOUND(ID) transformation)
Sliced the following arguments:
from/0
cons/0
n__from/0
(4) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
from → cons(n__from)
after(0', XS) → XS
after(s(N), cons(XS)) → after(N, activate(XS))
from → n__from
activate(n__from) → from
activate(X) → X
S is empty.
Rewrite Strategy: FULL
(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)
Infered types.
(6) Obligation:
TRS:
Rules:
from → cons(n__from)
after(0', XS) → XS
after(s(N), cons(XS)) → after(N, activate(XS))
from → n__from
activate(n__from) → from
activate(X) → X
Types:
from :: n__from:cons
cons :: n__from:cons → n__from:cons
n__from :: n__from:cons
after :: 0':s → n__from:cons → n__from:cons
0' :: 0':s
s :: 0':s → 0':s
activate :: n__from:cons → n__from:cons
hole_n__from:cons1_0 :: n__from:cons
hole_0':s2_0 :: 0':s
gen_n__from:cons3_0 :: Nat → n__from:cons
gen_0':s4_0 :: Nat → 0':s
(7) OrderProof (LOWER BOUND(ID) transformation)
Heuristically decided to analyse the following defined symbols:
after
(8) Obligation:
TRS:
Rules:
from →
cons(
n__from)
after(
0',
XS) →
XSafter(
s(
N),
cons(
XS)) →
after(
N,
activate(
XS))
from →
n__fromactivate(
n__from) →
fromactivate(
X) →
XTypes:
from :: n__from:cons
cons :: n__from:cons → n__from:cons
n__from :: n__from:cons
after :: 0':s → n__from:cons → n__from:cons
0' :: 0':s
s :: 0':s → 0':s
activate :: n__from:cons → n__from:cons
hole_n__from:cons1_0 :: n__from:cons
hole_0':s2_0 :: 0':s
gen_n__from:cons3_0 :: Nat → n__from:cons
gen_0':s4_0 :: Nat → 0':s
Generator Equations:
gen_n__from:cons3_0(0) ⇔ n__from
gen_n__from:cons3_0(+(x, 1)) ⇔ cons(gen_n__from:cons3_0(x))
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))
The following defined symbols remain to be analysed:
after
(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)
Proved the following rewrite lemma:
after(
gen_0':s4_0(
n6_0),
gen_n__from:cons3_0(
1)) →
gen_n__from:cons3_0(
1), rt ∈ Ω(1 + n6
0)
Induction Base:
after(gen_0':s4_0(0), gen_n__from:cons3_0(1)) →RΩ(1)
gen_n__from:cons3_0(1)
Induction Step:
after(gen_0':s4_0(+(n6_0, 1)), gen_n__from:cons3_0(1)) →RΩ(1)
after(gen_0':s4_0(n6_0), activate(gen_n__from:cons3_0(0))) →RΩ(1)
after(gen_0':s4_0(n6_0), from) →RΩ(1)
after(gen_0':s4_0(n6_0), cons(n__from)) →IH
gen_n__from:cons3_0(1)
We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).
(10) Complex Obligation (BEST)
(11) Obligation:
TRS:
Rules:
from →
cons(
n__from)
after(
0',
XS) →
XSafter(
s(
N),
cons(
XS)) →
after(
N,
activate(
XS))
from →
n__fromactivate(
n__from) →
fromactivate(
X) →
XTypes:
from :: n__from:cons
cons :: n__from:cons → n__from:cons
n__from :: n__from:cons
after :: 0':s → n__from:cons → n__from:cons
0' :: 0':s
s :: 0':s → 0':s
activate :: n__from:cons → n__from:cons
hole_n__from:cons1_0 :: n__from:cons
hole_0':s2_0 :: 0':s
gen_n__from:cons3_0 :: Nat → n__from:cons
gen_0':s4_0 :: Nat → 0':s
Lemmas:
after(gen_0':s4_0(n6_0), gen_n__from:cons3_0(1)) → gen_n__from:cons3_0(1), rt ∈ Ω(1 + n60)
Generator Equations:
gen_n__from:cons3_0(0) ⇔ n__from
gen_n__from:cons3_0(+(x, 1)) ⇔ cons(gen_n__from:cons3_0(x))
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))
No more defined symbols left to analyse.
(12) LowerBoundsProof (EQUIVALENT transformation)
The lowerbound Ω(n1) was proven with the following lemma:
after(gen_0':s4_0(n6_0), gen_n__from:cons3_0(1)) → gen_n__from:cons3_0(1), rt ∈ Ω(1 + n60)
(13) BOUNDS(n^1, INF)
(14) Obligation:
TRS:
Rules:
from →
cons(
n__from)
after(
0',
XS) →
XSafter(
s(
N),
cons(
XS)) →
after(
N,
activate(
XS))
from →
n__fromactivate(
n__from) →
fromactivate(
X) →
XTypes:
from :: n__from:cons
cons :: n__from:cons → n__from:cons
n__from :: n__from:cons
after :: 0':s → n__from:cons → n__from:cons
0' :: 0':s
s :: 0':s → 0':s
activate :: n__from:cons → n__from:cons
hole_n__from:cons1_0 :: n__from:cons
hole_0':s2_0 :: 0':s
gen_n__from:cons3_0 :: Nat → n__from:cons
gen_0':s4_0 :: Nat → 0':s
Lemmas:
after(gen_0':s4_0(n6_0), gen_n__from:cons3_0(1)) → gen_n__from:cons3_0(1), rt ∈ Ω(1 + n60)
Generator Equations:
gen_n__from:cons3_0(0) ⇔ n__from
gen_n__from:cons3_0(+(x, 1)) ⇔ cons(gen_n__from:cons3_0(x))
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))
No more defined symbols left to analyse.
(15) LowerBoundsProof (EQUIVALENT transformation)
The lowerbound Ω(n1) was proven with the following lemma:
after(gen_0':s4_0(n6_0), gen_n__from:cons3_0(1)) → gen_n__from:cons3_0(1), rt ∈ Ω(1 + n60)
(16) BOUNDS(n^1, INF)